Progress Rate in Noisy Genetic Programming for Choosing λ

نویسندگان

  • Jean-Baptiste Hoock
  • Olivier Teytaud
چکیده

Recently, it has been proposed to use Bernstein races for implementing non-regression testing in noisy genetic programming. We study the population size of such a (1+λ) evolutionary algorithm applied to a noisy fitness function optimization by a progress rate analysis and experiment it on a policy search application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bankruptcy Prediction: Dynamic Geometric Genetic Programming (DGGP) Approach

 In this paper, a new Dynamic Geometric Genetic Programming (DGGP) technique is applied to empirical analysis of financial ratios and bankruptcy prediction. Financial ratios are indeed desirable for prediction of corporate bankruptcy and identification of firms’ impending failure for investors, creditors, borrowing firms, and governments. By the time, several methods have been attempted in...

متن کامل

Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems

Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...

متن کامل

Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise

The presence of noise in real-world optimization problems poses difficulties to optimization strategies. It is frequently observed that evolutionary algorithms are quite capable of succeeding in noisy environments. Intuitively, the use of a population of candidate solutions alongside with some implicit or explicit form of averaging inherent in the algorithms is considered responsible. However, ...

متن کامل

Performance Analysis of Evolution Strategies with Multi- Recombination in High-Dimensional IRN-Search Spaces Disturbed by Noise

The presence of noise in real-world optimization problems poses difficulties to optimization strategies. It is frequently observed that evolutionary algorithms are quite capable of succeeding in noisy environments. Intuitively, the use of a population of candidate solutions alongside with some implicit or explicit form of averaging inherent in the algorithms is considered responsible. However, ...

متن کامل

Bedload transport predictions based on field measurement data by combination of artificial neural network and genetic programming

Bedload transport is an essential component of river dynamics and estimation of its rate is important to many aspects of river management. In this study, measured bedload by Helley- Smith sampler was used to estimate the bedload transport of Kurau River in Malaysia. An artificial neural network, genetic programming and a combination of genetic programming and a neural network were used to estim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011